Recursive Randomized Coloring Beats Fair Dice Random Colorings
نویسندگان
چکیده
منابع مشابه
Tabu Search for Graph Coloring, T-colorings and Set T-colorings
In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm integrates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint handling techniques. Empirical comparisons show that this algorithm approaches the best coloring ...
متن کاملMonochromatic 4-term arithmetic progressions in 2-colorings of Zn
This paper is motivated by a recent result of Wolf [12] on the minimum number of monochromatic 4-term arithmetic progressions (4-APs, for short) in Zp, where p is a prime number. Wolf proved that there is a 2-coloring of Zp with 0.000386% fewer monochromatic 4-APs than random 2-colorings; the proof is probabilistic and non-constructive. In this paper, we present an explicit and simple construct...
متن کاملParallel Graph
We introduce a new hybrid graph coloring algorithm, which combines a parallel version of Morgenstern's S-Impasse algorithm 26], with exhaustive search. Our goal is progress towards a coloring heuristic that works well without extensive tuning of algorithm parameters. We also contribute new test data arising in ve diierent application domains, including register allocation and course scheduling....
متن کاملOnline Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high p...
متن کاملFair Factorizations of the Complete Multipartite Graph and Related Edge-Colorings by
In this dissertation, first the technique of vertex amalgamations is used to extend known results on graph decompositions, and in particular on decompositions of the complete multipartite graph K(n, p) with p parts, each of which has n vertices. The decompositions focus on hamilton cycles and 1-factors that satisfy certain fairness notions, as well as frame versions of these results where each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001